Graph Closures and Metric Compactifications of Tv

نویسنده

  • A. K. STEINER
چکیده

It is shown that all compactifications of the positive integers N which have metrizable remainders are themselves metrizable. This is done by first proving that each Hausdorff compactification of a noncompact locally compact space is the graph closure in an appropriate space. It is then shown that any two compactifications of N which have homeomorphic metrizable remainders are homeomorphic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed point results in cone metric spaces endowed with a graph

In this paper, we prove the existence of fixed point for Chatterjea type mappings under $c$-distance in cone metric spaces endowed with a graph. The main results extend, generalized and unified some fixed point theorems on $c$-distance in metric and cone metric spaces.

متن کامل

The Existence Theorem for Contractive Mappings on $wt$-distance in $b$-metric Spaces Endowed with a Graph and its Application

In this paper, we study the existence and uniqueness of fixed points for mappings with respect to a $wt$-distance in $b$-metric spaces endowed with a graph. Our results are significant, since we replace the condition of continuity of mapping with the condition of orbitally $G$-continuity of mapping and we consider $b$-metric spaces with graph instead of $b$-metric spaces, under which can be gen...

متن کامل

Common fixed point results for graph preserving mappings in parametric $N_b$-metric spaces

In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of graph preserving mappings in parametric $N_b$-metric spaces. As some consequences of this study, we obtain several important results in parametric $b$-metric spaces, parametric $S$-metric spaces and parametric $A$-metric spaces. Finally, we provide some illustrative examples to ...

متن کامل

Solis Graphs and Uniquely Metric Basis Graphs

A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...

متن کامل

$G$-asymptotic contractions in metric spaces with a graph and fixed point results

In this paper, we discuss the existence and uniqueness of fixed points for $G$-asymptotic contractions in metric spaces endowed with a graph. The result given here is a new version of Kirk's fixed point theorem for asymptotic contractions in metric spaces endowed with a graph. The given result here is a generalization of fixed point theorem for asymptotic contraction from metric s paces to metr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010